//2923.找到冠军I
//https://leetcode.cn/problems/find-champion-i/?envType=daily-question&envId=2024-04-12
class Solution {
public:
    int findChampion(vector<vector<int>>& grid) {
        int n = grid.size();
        vector<int> v(n);
        int maxi = 0;
        for(int i = 0;i<n;++i) 
        {
            for(int& x:grid[i]) v[i] += x;
            if(v[i] > v[maxi]) maxi = i;
        }
        return maxi;
    }
};